TSTP Solution File: CSR136^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : CSR136^1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Fri Jul 15 21:37:26 EDT 2022
% Result : Theorem 0.21s 0.38s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of formulae : 49 ( 33 unt; 9 typ; 0 def)
% Number of atoms : 109 ( 41 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 173 ( 19 ~; 18 |; 8 &; 128 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 8 con; 0-2 aty)
% Number of variables : 39 ( 0 ^ 35 !; 4 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_num,type,
num: $tType ).
thf(tp_lAnna_THFTYPE_i,type,
lAnna_THFTYPE_i: $i ).
thf(tp_lBen_THFTYPE_i,type,
lBen_THFTYPE_i: $i ).
thf(tp_lBill_THFTYPE_i,type,
lBill_THFTYPE_i: $i ).
thf(tp_lBob_THFTYPE_i,type,
lBob_THFTYPE_i: $i ).
thf(tp_lMary_THFTYPE_i,type,
lMary_THFTYPE_i: $i ).
thf(tp_lSue_THFTYPE_i,type,
lSue_THFTYPE_i: $i ).
thf(tp_likes_THFTYPE_IiioI,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(tp_parent_THFTYPE_IiioI,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(1,axiom,
parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_007) ).
thf(2,axiom,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_006) ).
thf(3,axiom,
likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_005) ).
thf(4,axiom,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_004) ).
thf(5,axiom,
parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_003) ).
thf(6,axiom,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_002) ).
thf(7,axiom,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_001) ).
thf(8,axiom,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax) ).
thf(9,conjecture,
? [R: $i > $i > $o] :
( ( R @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( R @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [A: $i,B: $i] : ( R @ A @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(10,negated_conjecture,
( ( ? [R: $i > $i > $o] :
( ( R @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( R @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [A: $i,B: $i] : ( R @ A @ B ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[9]) ).
thf(11,plain,
( ( ? [R: $i > $i > $o] :
( ( R @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( R @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [A: $i,B: $i] : ( R @ A @ B ) ) )
= $false ),
inference(unfold_def,[status(thm)],[10]) ).
thf(12,plain,
( ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(13,plain,
( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(14,plain,
( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(15,plain,
( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(16,plain,
( ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(17,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(18,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(19,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(20,plain,
( ( ~ ? [R: $i > $i > $o] :
( ( R @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( R @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [A: $i,B: $i] : ( R @ A @ B ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[11]) ).
thf(21,plain,
( ( ! [R: $i > $i > $o] :
( ~ ( R @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( R @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ! [A: $i,B: $i] : ( R @ A @ B ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[20]) ).
thf(22,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(copy,[status(thm)],[19]) ).
thf(23,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(24,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(25,plain,
( ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(26,plain,
( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBen_THFTYPE_i )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(27,plain,
( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(28,plain,
( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(29,plain,
( ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lAnna_THFTYPE_i )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(30,plain,
( ( ! [R: $i > $i > $o] :
( ~ ( R @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( R @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ! [A: $i,B: $i] : ( R @ A @ B ) ) )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(31,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
= $false ),
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(32,plain,
! [SV1: $i > $i > $o] :
( ( ~ ( SV1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( SV1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ! [SY3: $i,SY4: $i] : ( SV1 @ SY3 @ SY4 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[30]) ).
thf(33,plain,
! [SV1: $i > $i > $o] :
( ( ( ~ ( SV1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( SV1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
= $true )
| ( ( ! [SY3: $i,SY4: $i] : ( SV1 @ SY3 @ SY4 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[32]) ).
thf(34,plain,
! [SV1: $i > $i > $o] :
( ( ( ~ ( SV1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
= $true )
| ( ( ~ ( SV1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
= $true )
| ( ( ! [SY3: $i,SY4: $i] : ( SV1 @ SY3 @ SY4 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[33]) ).
thf(35,plain,
! [SV1: $i > $i > $o] :
( ( ( SV1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $false )
| ( ( ~ ( SV1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
= $true )
| ( ( ! [SY3: $i,SY4: $i] : ( SV1 @ SY3 @ SY4 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[34]) ).
thf(36,plain,
! [SV1: $i > $i > $o] :
( ( ( SV1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $false )
| ( ( SV1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $false )
| ( ( ! [SY3: $i,SY4: $i] : ( SV1 @ SY3 @ SY4 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[35]) ).
thf(37,plain,
! [SV2: $i,SV1: $i > $i > $o] :
( ( ( ! [SY5: $i] : ( SV1 @ SV2 @ SY5 ) )
= $true )
| ( ( SV1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $false )
| ( ( SV1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[36]) ).
thf(38,plain,
! [SV3: $i,SV2: $i,SV1: $i > $i > $o] :
( ( ( SV1 @ SV2 @ SV3 )
= $true )
| ( ( SV1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $false )
| ( ( SV1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[37]) ).
thf(39,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[22,38,31,29,28,27,26,25,24]) ).
thf(40,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : CSR136^1 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.14 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 11 16:38:49 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.36
% 0.14/0.36 No.of.Axioms: 8
% 0.14/0.36
% 0.14/0.36 Length.of.Defs: 0
% 0.14/0.36
% 0.14/0.36 Contains.Choice.Funs: false
% 0.14/0.36 (rf:0,axioms:8,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:10,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.21/0.38
% 0.21/0.38 ********************************
% 0.21/0.38 * All subproblems solved! *
% 0.21/0.38 ********************************
% 0.21/0.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:8,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:39,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.21/0.39
% 0.21/0.39 %**** Beginning of derivation protocol ****
% 0.21/0.39 % SZS output start CNFRefutation
% See solution above
% 0.21/0.39
% 0.21/0.39 %**** End of derivation protocol ****
% 0.21/0.39 %**** no. of clauses in derivation: 40 ****
% 0.21/0.39 %**** clause counter: 39 ****
% 0.21/0.39
% 0.21/0.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:8,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:39,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------